Markov Decision Process and Linear Programming Based Control of MAP/MAP/N Queues
نویسندگان
چکیده
We investigate the control problem of the optimal choice of idle server (if any) for arriving customer in order to minimize the mean system time (waiting time + service time). The considered MAP/MAP/N queue consists of a common infinite buffer and multiple identical servers with MAP service processes whose phases (internal states) are known. Customers arrive according to a MAP (whose phase is also known) and are served with work conserving policy. Idle servers preserve their phases. We transform the obtained infinite state optimization problem to a finite state one and apply two optimization procedures, policy iteration of finite state MDP and linear programming.
منابع مشابه
Optimal Selection of Arrival and Service Rates in Tandem Queues
We consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue k (k = 1, 2, ..., n − 1) must go on to queue k + 1 after finishing service at server associated queue k. Customers arriving to queue n leave the system after finishing service at the la...
متن کاملCommuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...
متن کاملIntegration of SimWeight and Markov Chain to Predict Land Use of Lavasanat Basin
Production and prediction of land-use/land cover changes (LULCC) map are among the significant issues regarding input of many environmental and hydrological models. Among various introduced methods, similarity-weighted instance-based machine learning algorithm (SimWeight) and Markov-chain with lower complexity and proper performnce are frequently used. The main aim of this study is utilizing Si...
متن کاملCommuting matrices in the sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and different representations for their sojourn time distribution have been derived. More specifically, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queues. While QBD queues have a...
متن کاملDetection and prediction of land use/ land cover changes using Markov chain model and Cellular Automata (CA-Markov), (Case study: Darab plain)
unprincipled changes in land use are major challenges for many countries and different regions of the world, which in turn have devastating effects on natural resources, Therefore, the study of land-use changes has a fundamental and important role for environmental studies. The purpose of this study is to detect and predicting of land use/ land cover (LULC) changes in Darab plain through the Ma...
متن کامل